A Ladder Spherical Evolution Search Algorithm

نویسندگان

چکیده

In 2019, a completely new algorithm, spherical evolution (SE), was proposed. The brand search style in SE has been proved to have strong capability. order take advantage of SE, we propose novel method called the ladder descent (LD) improve SE' population update strategy and thereafter (LSE) algorithm. With number iterations increasing, range parent individuals eligible produce offspring gradually changes from entire current optimal individual, thereby enhancing convergence ability Experiment results on IEEE CEC2017 benchmark functions indicate effectiveness LSE.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum ant colony optimization algorithm based onBloch spherical search

-In the existing quantum-behaved optimization algorithms, almost all of the individuals are encoded by qubits described on plane unit circle. As qubits contain only a variable parameter, quantum properties have not been fully embodied, which limits the optimization ability rise further. In order to solve this problem, this paper proposes a quantum ant colony optimization algorithm based on Bloc...

متن کامل

Memetic Search in Differential Evolution Algorithm

Differential Evolution (DE) is a renowned optimization stratagem that can easily solve nonlinear and comprehensive problems. DE is a well known and uncomplicated population based probabilistic approach for comprehensive optimization. It has apparently outperformed a number of Evolutionary Algorithms and further search heuristics in the vein of Particle Swarm Optimization at what time of testing...

متن کامل

A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms

In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...

متن کامل

A New Differential Evolution Algorithm with Alopex-Based Local Search

Differential evolution (DE), as a class of biologically inspired and meta-heuristic techniques, has attained increasing popularity in solving many real world optimization problems. However, DE is not always successful. It can easily get stuck in a local optimum or an undesired stagnation condition. This paper proposes a new DE algorithm Differential Evolution with Alopex-Based Local Search (DEA...

متن کامل

Offering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2021

ISSN: ['0916-8532', '1745-1361']

DOI: https://doi.org/10.1587/transinf.2020edl8102